- directed Hamiltonian line
- Математика: гамильтонов путь
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Classical Hamiltonian quaternions — For the history of quaternions see:history of quaternions For a more general treatment of quaternions see:quaternions William Rowan Hamilton invented quaternions, a mathematical entity in 1843. This article describes Hamilton s original treatment … Wikipedia
Ménage problem — A table with ten place settings. According to the solution to the ménage problem, there are 3120 different ways in which five couples can choose seats at this table in such a way that men and women alternate and do not sit next to their partners … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
mechanics — /meuh kan iks/, n. 1. (used with a sing. v.) the branch of physics that deals with the action of forces on bodies and with motion, comprised of kinetics, statics, and kinematics. 2. (used with a sing. v.) the theoretical and practical application … Universalium
Dynamical billiards — The Bunimovich stadium is a chaotic dynamical billiard A billiard is a dynamical system in which a particle alternates between motion in a straight line and specular reflections from a boundary. When the particle hits the boundary it reflects… … Wikipedia
Answer set programming — (ASP) is a form of declarative programming oriented towards difficult (primarily NP hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models … Wikipedia
Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
Antonin Scalia — Infobox Judge name = Antonin Gregory Scalia imagesize = caption = office = Associate Justice of the United States Supreme Court termstart = September 26 1986 termend = nominator = Ronald Reagan appointer = predecessor = William H. Rehnquist… … Wikipedia